A characterization of (γt, γ2)-trees

نویسندگان

  • Xinmin Hou
  • Ning Li
  • You Lu
  • Jun-Ming Xu
چکیده

Let γt(G) and γ2(G) be the total domination number and the 2domination number of a graph G, respectively. It has been shown that: γt(T ) ≤ γ2(T ) for any tree T . In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mustapha Chellali BOUNDS ON THE 2-DOMINATION NUMBER IN CACTUS GRAPHS

A 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in S is dominated at least twice. The minimum cardinality of a 2-dominating set of G is the 2-domination number γ2(G). We show that if G is a nontrivial connected cactus graph with k(G) even cycles (k(G) ≥ 0), then γ2(G) ≥ γt(G) − k(G), and if G is a graph of order n with at most one cycle, then γ2(G) > (n+ l...

متن کامل

T Direct Gf N

A T -Direct code is defined as the set of T F -ary linear codes Γ1,Γ2, . . . ,ΓT such that Γi ∩ Γi = {0}, where Γi = Γ1 ⊕ Γ2⊕ · · · ⊕ Γi−1⊕ Γi+1 ⊕ · · · ⊕ ΓT is the dual of Γi with respect to the direct sum Λ = Γ1 ⊕ Γ2⊕ · · · ⊕ ΓT for each i = 1, 2, . . . , T . In this paper, a construction to a class of T -Direct codes with the constituent codes from the class of 2-Cyclic Maximum Rank Distance...

متن کامل

Characterization of trees with equal 2-domination number and domination number plus two

Let G = (V (G), E(G)) be a simple graph, and let k be a positive integer. A subset D of V (G) is a k-dominating set if every vertex of V (G) − D is dominated at least k times by D. The k-domination number γk(G) is the minimum cardinality of a k-dominating set of G. In [5] Volkmann showed that for every nontrivial tree T, γ2(T ) ≥ γ1(T ) + 1 and characterized extremal trees attaining this bound....

متن کامل

A note on the 2-domination number of a tree

For a positive integer k, a set of vertices S in a graph G is said to be a kdominating set if each vertex x in V (G)−S has at least k neighbors in S. The order of a smallest k-dominating set of G is called the k-domination number of G and is denoted by γk(G). In Blidia, Chellali and Favaron [Australas. J. Combin. 33 (2005), 317–327], they proved that a tree T satisfies α(T ) ≤ γ2(T ) ≤ 3 2 α(T ...

متن کامل

Trees with equal 2-domination and 2-independence numbers

Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominated at least 2 times, and S is a 2-independent set of G if every vertex of S has at most one neighbor in S. The minimum cardinality of a 2-dominating set a of G is the 2-domination number γ2(G) and the maximum cardinality of a 2-independent set of G is the 2-independence number β2(G). Fink and Jaco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discussiones Mathematicae Graph Theory

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2010